package a.f.e;

import java.util.BitSet;

class o
  extends BitSet
{
  public o() {}
  
  public o(int paramInt)
  {
    super(paramInt);
  }
  
  public int nextSetBit(int paramInt)
  {
    int m = a.B;
    int k = a.A;
    int i = size();
    do
    {
      for (int j = paramInt; k == 0; j++)
      {
        if (j >= i) {
          break;
        }
        if (k != 0) {
          break label51;
        }
        if (get(j)) {
          return j;
        }
      }
    } while (m != 0);
    label51:
    return -1;
  }
  
  public int cardinality()
  {
    int n = a.B;
    int m = a.A;
    int i = size();
    int j = 0;
    do
    {
      for (int k = 0; m == 0; k++)
      {
        if (k >= i) {
          break;
        }
        if (m != 0) {
          break label54;
        }
        if (get(k)) {
          j++;
        }
      }
    } while (n != 0);
    label54:
    return j;
  }
  
  public void clear(int paramInt1, int paramInt2)
  {
    int k = a.B;
    int j = a.A;
    do
    {
      for (int i = paramInt1; j == 0; i++)
      {
        if (i >= paramInt2) {
          break;
        }
        clear(i);
      }
    } while (k != 0);
  }
  
  public void set(int paramInt1, int paramInt2)
  {
    int k = a.B;
    int j = a.A;
    do
    {
      for (int i = paramInt1; j == 0; i++)
      {
        if (i >= paramInt2) {
          break;
        }
        set(i);
      }
    } while (k != 0);
  }
}


/* Location:           E:\idea\
 * Qualified Name:     a.f.e.o
 * JD-Core Version:    0.7.0.1
 */